翻訳と辞書 Words near each other ・ Tennessee login law ・ Tennessee Lottery ・ Tennessee Maneuver Area ・ Tennessee marble ・ Tennessee Marriage Protection Amendment ・ Tennessee Medical Association ・ Tennessee Meiji Gakuin High School ・ Tennessee Military Department ・ Tennessee Military Institute ・ Tennessee Miss Basketball ・ Tennessee Moon ・ Tennessee Mr. Basketball ・ Tennessee Mud Frogs ・ Tennen Rishin-ryū ・ Tennena Cone ・ Tennenbaum's theorem ・ Tennenbronn ・ Tennenlohe ・ Tennenshoku Katsudō Shashin ・ Tennent ・ Tennent Caledonian Cup ・ Tennent Islands ・ Tennent's Vital ・ Tennent, New Jersey ・ Tennents' Sixes ・ Tennerton, West Virginia ・ Tennessean ・ Tennessean (train) ・ Tennesseans for Fair Taxation ・ Tennessee Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Tennenbaum's theorem ： ウィキペディア英語版 Tennenbaum's theorem Tennenbaum's theorem, named for Stanley Tennenbaum who presented the theorem in 1959, is a result in mathematical logic that states that no countable nonstandard model of Peano arithmetic (PA) can be recursive. ==Recursive structures for PA== A structure $\backslash scriptstyle\; M$ in the language of PA is recursive if there are recursive functions + and × from $\backslash scriptstyle\; N\; \backslash times\; N$ to $\backslash scriptstyle\; N$, a recursive two-place relation < on $\backslash scriptstyle\; N$, and distinguished constants $\backslash scriptstyle\; n\_0,n\_1$ such that : $$ (N,+,\times,<,n_,n_) \equiv M, \, where $\backslash scriptstyle\; \backslash equiv$ indicates isomorphism and $\backslash scriptstyle\; N$ is the set of (standard) natural numbers. Because the isomorphism must be a bijection, every recursive model is countable. There are many nonisomorphic countable nonstandard models of PA. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Tennenbaum's theorem」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.